RCC - 5 and its
نویسنده
چکیده
We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework. The satis-ability problem for RCC-5 is known to be NP-complete but not much is known about its approximately four billion subclasses. We provide a complete classiication of satissability for all these subclasses into polynomial and NP-complete respectively. In the process, we identify all maximal tractable subalgebras which are four in total.
منابع مشابه
A Complete Classi cation of Tractabilityin the Spatial Theory RCC - 5
We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning. The satissability problem for RCC-5 is known to be NP-complete but not much is known about its approximately four billion subclasses. We provide a complete classiication of satissability for all these subclasses into polynomial and NP-complete respec...
متن کاملDyspnea as the First Manifestation of Silent Renal Cell Carcinoma
Renal cell carcinoma (RCC) accounts for only 3% of adult malignancies, and the lung is the most common site of metastasis of this tumor, which may be accompanied by pleural metastasis. However, solitary pleural involvement is very rare and its presentation with dyspnea as the first manifestation of RCC is extremely rare.We describe a 39-year-old male with episodes of dyspnea dating back 6...
متن کاملA Complete Classiication of Tractability in Rcc-5
We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning. The satissability problem for RCC-5 is known to be NP-complete but not much is known about its approximately four billion subclasses. We provide a complete classiication of satissability for all these subclasses into polynomial and NP-complete respec...
متن کاملA Complete Classification of Tractability in RCC-5
We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning. The satis ability problem for RCC-5 is known to be NP-complete but not much is known about its approximately four billion subclasses. We provide a complete classi cation of satis ability for all these subclasses into polynomial and NPcomplete respect...
متن کاملExpression Of P53 And Ki67 Proteins In Renal Cell Carcinoma And Its Relationship With Nuclear Grade
Background and Objective: Evaluation of tumor proliferative activity may provide a predicting parameter to estimate biologic aggression and a subsequent prognosis that has been evaluated in many malignancies. We have selected renal cell carcinoma (RCC) in this study. To determine tumor proliferative activity, KI67 antibody was applied and results were compared with apoptosis, applying P53 antib...
متن کامل